Local Convergence Analysis of FastICA

نویسندگان

  • Hao Shen
  • Knut Hüper
چکیده

The FastICA algorithm can be considered as a selfmap on a manifold. It turns out that FastICA is a scalar shifted version of an algorithm recently proposed. We put these algorithms into a dynamical system framework. The local convergence properties are investigated subject to an ideal ICA model. The analysis is very similar to the wellknown case in numerical linear algebra when studying power iterations versus Rayleigh quotient iteration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Optimisation and FastICA Algorithms

Independent component analysis is a challenging problem in the area of unsupervised adaptive filtering. Recently, there has been an increasing interest in using geometric optimisation for adaptive filtering. The performance of ICA algorithms significantly depends on the choice of the contrast function and the optimisation algorithm used in obtaining the demixing matrix. In this paper we focus o...

متن کامل

FastISA: A fast fixed-point algorithm for independent subspace analysis

Independent Subspace Analysis (ISA; Hyvarinen & Hoyer, 2000) is an extension of ICA. In ISA, the components are divided into subspaces and components in different subspaces are assumed independent, whereas components in the same subspace have dependencies.In this paper we describe a fixed-point algorithm for ISA estimation, formulated in analogy to FastICA. In particular we give a proof of the ...

متن کامل

Method Based on Improved Fastica-lsm for Harmonic Detection in Power System

This paper proposes a new method based on improved FastICA (fast independent component analysis)LSM (the least square method), in order to improve the accuracy and speed of harmonic detection in power system. This work ameliorates the traditional FastICA algorithm by defining the initial value of demixing matrix iteration, thus inducing the iteration times and eliminating the problem of higher-...

متن کامل

Average Convergence Behavior of the FastICA Algorithm for Blind Source Separation

The FastICA algorithm is a popular procedure for independent component analysis and blind source separation. In this paper, we analyze the average convergence behavior of the single-unit FastICA algorithm with kurtosis contrast for general m-source noiseless mixtures. We prove that this algorithm causes the average inter-channel interference (ICI) to converge exponentially with a rate of (1/3) ...

متن کامل

A S#a#is#ica& C'()e+,e(ce A(a&-sis '. #/e .as#ica A&,'+i#/0 .'+ #1'-s'3+ce 0i4#3+es

While the FastICA algorithm is a popular procedure for independent component analysis (ICA) and blind source separation, its average convergence behavior has yet to be studied. This paper provides several statistical convergence analyses of the kurtosis-based FastICA algorithm for two-source noiseless mixtures. We derive explicit and approximate expressions for the evolutions of the average val...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006